Grouting technology in tunnelling and dam constructionSHROFF, Arvind V; SHAH, Dhananjay L.1993, pp XIV-604, isbn 90-5410-210-1, p, isbn 90-5410-210-1Book

Azimuthal anisotropy of longwave and infrared window radiances from the Clouds and the Earth's Radiant Energy System on the Tropical Rainfall Measuring Mission and Terra satellitesMINNIS, Patrick; GAMBHEER, Arvind V; DOELLING, David R et al.Journal of geophysical research. 2004, Vol 109, Num D8, pp D08202.1-D08202.13, issn 0148-0227Article

Life cycle characteristics of deep cloud systems over the Indian region using INSAT-1B pixel dataGAMBHEER, Arvind V; BHAT, G. S.Monthly weather review. 2000, Vol 128, Num 12, pp 4071-4083, issn 0027-0644Article

Dielectric relaxation and thermodynamic properties of polyvinylpyrrolidone using time domain reflectometrySARODE, Arvind V; KUMBHARKHANE, Ashok C.Polymer international. 2012, Vol 61, Num 4, pp 609-615, issn 0959-8103, 7 p.Article

The Ideal Membership Problem and polynomial identity testingARVIND, V; MUKHOPADHYAY, Partha.Information and computation (Print). 2010, Vol 208, Num 4, pp 351-363, issn 0890-5401, 13 p.Article

Graph isomorphism is in SPPARVIND, V; KURUR, Piyush P.Information and computation (Print). 2006, Vol 204, Num 5, pp 835-852, issn 0890-5401, 18 p.Article

A nonadaptive NC checker for permutation group intersectionARVIND, V; TORAN, Jacobo.Theoretical computer science. 2001, Vol 259, Num 1-2, pp 597-611, issn 0304-3975Article

On pseudorandomness and resource-bounded measureARVIND, V; KÖBLER, Johannes.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 205-221, issn 0304-3975Article

Numerical analysis of optical fibers with arbitrary refractive index profileSIRCAR, P; ARVIND, V.Journal of electromagnetic waves and applications. 1997, Vol 11, Num 9, pp 1213-1227, issn 0920-5071Article

RESORCINOLIC GROUT FOR INJECTING SANDY FOUNDATIONSDISCUSSION AND REPLY = UN CIMENT DIPHENOLIQUE POUR INJECTION DANS DES FONDATIONS SUR DU SABLE; DISCUSSION ET REPONSEJAMES ANTHONY NOEL; SHROFF ARVIND V; SHAH DHANANJAY L et al.1981; J. GEOTECH. ENG. DIV.; ISSN 0093-6405; USA; DA. 1981-11; VOL. 107; NO GT11; PP. 1588-1590; BIBL. 10 REF.Article

On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulasARVIND, V; BISWAS, S.Theoretical computer science. 1989, Vol 68, Num 2, pp 123-134, issn 0304-3975Conference Paper

An O (n²) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentencesARVIND, V; BISWAS, S.Information processing letters. 1987, Vol 24, Num 1, pp 67-69, issn 0020-0190Article

The counting complexity of group-definable languagesARVIND, V; VINODCHANDRAN, N. V.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 199-218, issn 0304-3975Article

Sparse sets, approximable sets, and parallel queries to NPARVIND, V; TORAN, J.Information processing letters. 1999, Vol 69, Num 4, pp 181-188, issn 0020-0190Article

A note on decision versus search for graph automorphismAGRAWAL, M; ARVIND, V.Information and computation (Print). 1996, Vol 131, Num 2, pp 179-189, issn 0890-5401Article

Critical review of the epidemiology literature on the potential cancer risks of methyl methacrylateTOMENSON, John A; CARPENTER, Arvind V; PEMBERTON, Mark A et al.International archives of occupational and environmental health. 2005, Vol 78, Num 8, pp 603-612, issn 0340-0131, 10 p.Article

ON COMPUTING THE DISTINGUISHING NUMBERS OF PLANAR GRAPHS AND BEYOND: A COUNTING APPROACHARVIND, V; CHENG, Christine T; DEVANUR, Nikhil R et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1297-1324, issn 0895-4801, 28 p.Article

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set ProblemARVIND, V; TORAN, Jacobo.Lecture notes in computer science. 2006, pp 233-242, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

On resource-bounded measure and pseudorandomnessARVIND, V; KÖBLER, J.Lecture notes in computer science. 1997, pp 235-249, issn 0302-9743, isbn 3-540-63876-8Conference Paper

Foundations of software technology and theoretical computer science (Chennai, 17-19 December 1998)Arvind, V; Ramanujam, R.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-65384-8, XII, 366 p, isbn 3-540-65384-8Conference Proceedings

The Parallel Complexity of Graph Canonization Under Abelian Group ActionARVIND, V; KÖBLER, Johannes.Algorithmica. 2013, Vol 67, Num 2, pp 247-276, issn 0178-4617, 30 p.Conference Paper

On hypergraph and graph isomorphism with bounded color classesARVIND, V; KÖBLER, Johannes.Lecture notes in computer science. 2006, pp 384-395, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 12 p.Conference Paper

On the complexity of computing units in a number fieldARVIND, V; KURUR, Piyush P.Lecture notes in computer science. 2004, pp 72-86, issn 0302-9743, isbn 3-540-22156-5, 15 p.Conference Paper

The complexity of modular graph automorphismARVIND, V; BEIGEL, R; LOZANO, A et al.SIAM journal on computing (Print). 2001, Vol 30, Num 4, pp 1299-1320, issn 0097-5397Article

Parameterized learnability of juntasARVIND, V; KÖBLER, Johannes; LINDNER, Wolfgang et al.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 4928-4936, issn 0304-3975, 9 p.Article